Approximability of Capacitated Network Design

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multicommodity Capacitated Network Design

This paper presents a comprehensive survey of models and algorithms for multicommodity capacitated network design problems, which are mostly encountered in telecommunications and transportation network planning. These problems are important not only due to the major relevance of their applications, but also because they pose considerable modeling and algorithmic challenges. We present a general...

متن کامل

Multicommodity Capacitated Network Design Problem

We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved...

متن کامل

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

متن کامل

Capacitated Network Design on Undirected Graphs

In this paper, we study the approximability of the capacitated network design problem (Cap-NDP) on undirected graphs: GivenG = (V,E) with non-negative costs c and capacities u on its edges, sourcesink pairs (si, ti) with demand ri, the goal is to find the minimum cost subgraph where the minimum (si, ti) cut with u-capacities is at least ri. When u ≡ 1, we get usual SNDP for which Jain gave a 2-...

متن کامل

Capacitated Network Design with Uncertain Demand

We consider a capacity expansion problem arising in the design of telecommunication networks. The problem is to install capacity on links of the network so as to meet customer demand while minimizing total costs incurred. When studying this and related problems it is customary to assume that point to point demands are given. This will not be the case in practice, however, since future demand is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2014

ISSN: 0178-4617,1432-0541

DOI: 10.1007/s00453-013-9862-4